The Resource Usage Aware Backfilling
نویسندگان
چکیده
Job scheduling policies for HPC centers have been extensively studied in the last few years, especially backfilling based policies. Almost all of these studies have been done using simulation tools. All the existent simulators use the runtime (either estimated or real) provided in the workload as a basis of their simulations. In our previous work we analyzed the impact on system performance of considering the resource sharing (memory bandwidth) of running jobs including a new resource model in the Alvio simulator. Based on this studies we proposed the LessConsume and LessConsume Threshold resource selection policies. Both are oriented to reduce the saturation of the shared resources thus increasing the performance of the system. The results showed how both resource allocation policies shown how the performance of the system can be improved by considering where the jobs are finally allocated. Using the LessConsume Threshold Resource Selection Policy, we propose a new backfilling strategy : the Resource Usage Aware Backfilling job scheduling policy. This is a backfilling based scheduling policy where the algorithms which decide which job has to be executed and how jobs have to be backfilled are based on a different Threshold configurations. This backfilling variant that considers how the shared resources are used by the scheduled jobs. Rather than backfilling the first job that can moved to the run queue based on the job arrival time or job size, it looks ahead to the next queued jobs, and tries to allocate jobs that would experience lower penalized runtime caused by the resource sharing saturation. In the paper we demostrate how the exchange of scheduling information between the local resource manager and the scheduler can improve substantially the performance of the system when the resource sharing is considered. We show how it can achieve a close response time performance that the shorest job first Backfilling with First Fit (oriented to improve the start time for the allocated jobs) providing a qualitative improvement in the number of killed jobs and in the percentage of penalized runtime.
منابع مشابه
Power-aware Resource Allocation via Online Simulation with Multiple-queue Backfilling
Although traditional scheduling policies for high-end parallel systems focus on minimizing average job wait time while maximizing system utilization, actual supercomputer workload traces confirm the existence of significant periods of time of low utilization. Previous work has shown that, in the context of backfilling schedulers, portions of such high-end systems can be selectively powered down...
متن کاملResource Sharing Usage Aware Resource Selection Policies for Backfilling Strategies
Job scheduling policies for HPC centers have been extensively studied in the last few years, specially backfilling based policies. Almost all of these studies have been done using simulation tools. All the existent simulators use the runtime (either estimated or real) provided in the workload as a basis of their simulations. In our previous work we analyzed the impact on system performance of c...
متن کاملResource-usage-aware configuration in software product lines
Deriving concrete products from a product-line infrastructure requires resolving the variability captured in the product line, based on the company market strategy or requirements from specific customers. Selecting the most appropriate set of features for a product is a complex task, especially if quality requirements have to be considered. Resource-usage-aware configuration aims at providing a...
متن کاملA Multi-criteria Class-based Job Scheduler for Large Computing Farms
In this paper we propose a new multi-criteria class-based job scheduler able to dynamically schedule a stream of batch jobs on large-scale computing farms. It is driven by several configuration parameters allowing the scheduler customization with respect to the goals of an installation. The proposed scheduling policies allow to maximize the resource usage and to guarantee the applications QoS r...
متن کاملSynthesis of Resource-Aware Robotic Systems
This paper describes an approach to make robotic systems “resource-aware”, in the sense that they can adapt optimally to the available computation and communication resources. A resource-aware application is one where the functionality implemented depends on the resources usage, such as timing information (latency, throughput) and power consumption. Allowing this flexibility introduces a recurs...
متن کامل